全文获取类型
收费全文 | 175篇 |
免费 | 52篇 |
国内免费 | 21篇 |
专业分类
248篇 |
出版年
2024年 | 3篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 18篇 |
2015年 | 11篇 |
2014年 | 19篇 |
2013年 | 18篇 |
2012年 | 18篇 |
2011年 | 20篇 |
2010年 | 10篇 |
2009年 | 9篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 11篇 |
2005年 | 12篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有248条查询结果,搜索用时 15 毫秒
21.
Kurt M. Bretthauer 《海军后勤学研究》2000,47(1):1-17
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000 相似文献
22.
23.
小波网络为非线性系统辨识研究提供了一种有效的方法,但目前用于小波网络学习的进化算法易陷入局部极小等缺陷.结合生物免疫系统的概念和理论,在非线性系统辨识中引入基于免疫算法的小波网络.该算法中抗体通过浓度相互作用的机制来促进或抑制抗体的生成,借此保持抗体的多样性,并产生了高亲和力的抗体对种群进行不断的更新,提高了算法的全局搜索能力和收敛速度.最后,把基于免疫算法的小波网络用于一个非线性系统辨识的标准实例中,仿真结果验证了该算法的有效性. 相似文献
24.
25.
Sunkyo Kim 《海军后勤学研究》2005,52(5):399-408
In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
26.
In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
27.
针对公众聚集场所、消防安全重点单位,探讨如何利用计算机网络及通信系统做好消防工作,并提出了计算机报警系统误报率、漏报率较高等问题的解决办法。 相似文献
28.
以具有层次结构的局域网作为拓扑模型,考虑共因失效和关联失效这2类节点非独立失效事件发生的情况,建立了交换机节点失效模型来模拟交换机失效,利用Monte-Carlo仿真算法近似计算出网络的两端可靠性,研究2种共因失效事件和3种关联失效事件对网络端端可靠性的影响。结果表明:因资源节点出现故障和协议层出现错误而导致交换机失效的共因失效事件均会降低网络可靠性,且资源节点失效概率或协议层失效概率越大,网络可靠性越低;而由于使用了热备份技术、堆叠技术以及发生广播风暴导致的关联失效事件,即使节点独立失效概率很小,只要相关因数足够大,故障都会快速传播,导致网络可靠性迅速下降。 相似文献
29.
30.
基于神经网络和功率谱的水中目标信号检测方法 总被引:2,自引:0,他引:2
将功率谱和神经网络相结合,应用于高海况、低信噪比条件下,水中目标信号的特征提取中.文中首先对信号进行功率谱估计,利用目标信号功率主要集中在低频部分的特点,提取低频信号的能量作为特征,然后利用人工神经网络对目标信号进行检测.利用不同浪级情况下海洋水压场的仿真信号数据,对某型目标舰船的水压信号进行了检测计算,验证了该方法的有效性,尤其是达到了在高海况、低信噪比条件下,对目标信号检测率比较高、虚警率比较低的效果. 相似文献